A CONSTRUcrION OF NON - GRS MDS CODES
نویسنده
چکیده
We present a construction of long MDS codes which are not of the generalized Reed-Solomon (GRS) type. The construction employs subsets S, IS I = m, of a finite field F = GF(q) with the property that no t distinct elements of S add up to some fixed element of F . Large subsets of this kind are used to construct [n=m+2,k=t+l] non-GRS MDS codes over F. T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T eh ni ca l R ep or t C S0 50 9 19 88
منابع مشابه
A construction of non-Reed-Solomon type MDS codes
We present a construction of long MDS codes which are not of the generalized ReedSolomon (GRS) type. The construction employs subsets S, S = m, of a finite field F = GF(q) with the property that no t distinct elements of S add up to some fixed element of F . Large subsets of this kind are used to construct [n = m + 2, k = t +1] non-GRS MDS codes over F .
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملCounting generalized Reed-Solomon codes
In this article we count the number of [n, k] generalized Reed– Solomon (GRS) codes, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of [n, 3] MDS codes with n = 6, 7, 8, 9.
متن کاملTwo new classes of quantum MDS codes
Let p be a prime and let q be a power of p. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distanceseparable (MDS) codes with parameters [[tq, tq − 2d+ 2, d]]q for any 1 ≤ t ≤ q, 2 ≤ d ≤ ⌊ tq+q−1 q+1 ⌋+ 1, and [[t(q + 1) + 2, t(q + 1)− 2d+ 4, d]]q for any 1 ≤ t ≤ q− 1, 2 ≤ d ≤ t+2 with (p, t, d) 6= (...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کامل